On two problems over polyhedral convex sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note on Prime Representations of Convex Polyhedral Sets

Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation of the polyhedron is one that contains no redundant constraints. We present a sharp upper bound on the difference between the cardinalities of any two primes.

متن کامل

Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets

Linear and nonlinear variational inequality problems over a polyhedral convex set are analyzed parametrically. Robinson’s notion of strong regularity, as a criterion for the solution set to be a singleton depending Lipschitz continuously on the parameters, is characterized in terms of a new “critical face” condition and in other ways. The consequences for complementarity problems are worked out...

متن کامل

Normal Fans of Polyhedral Convex Sets Structures and Connections

The normal fan of a polyhedral convex set in Rn is the collection of its normal cones. The structure of the normal fan reflects the geometry of that set. This paper reviews and studies properties about the normal fan. In particular, it investigates situations in which the normal fan of a polyhedral convex set refines, or is a subfan of, that of another set. It then applies these techniques in s...

متن کامل

Numerical Computation for Demyanov Difference of Polyhedral Convex Sets

Under the assumption of polyhedron, the Demyanov difference of convex compact sets is computed via some linear programmings by C procedure. The difference from the existing results is also compared, and some examples with the corresponding numerical results are given.

متن کامل

Separation of convex polyhedral sets with column parameters

Separation is a famous principle and separation properties are important for optimization theory and various applications. In practice, input data are rarely known exactly and it is advisable to deal with parameters. In this article, we are concerned with the basic characteristics (existence, description, stability etc.) of separating hyperplanes of two convex polyhedral sets depending on param...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Science and Cybernetics

سال: 2015

ISSN: 1813-9663,1813-9663

DOI: 10.15625/1813-9663/1/1/6661